A Survey of High-Rate Constrained Codes
نویسنده
چکیده
The construction of high-rate codes is far from obvious, as table look-up for encoding and decoding is an engineering impracticality. The usual approach is to supplement the p source bits withm = q p bits. Under certain, usually simple, rules the source word is modi ed in such a way that the modi ed word plus supplement bits comply with the constraints. The information that certain modi cations have been made is carried by the m supplement bits. The receiver, on reception of the word, will undo the modi cations. In order to reduce complexity and error propagation, the number of bits a ected by a modi cation should be as small as possible. We will survey some examples of code constructions.
منابع مشابه
Multilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کاملWeakly constrained codes
We report on the performance of a new class of constrained codes, called weakly constrained codes. Weakly constrained codes do not strictly guarantee the imposed channel constraints but rather generate codewords that violate with given (small) probability the prescribed constraint. Weakly constrained codes are speci cally of interest when it is desirable that the code rate R = p=q is very high ...
متن کاملAn Investigation into Indices of Professional Ethics for Faculty Members Using FAHP
Background: Every organizational unit requires ethical codes, also known as professional ethics, in compliance with its professional structure. Therefore, this study was conducted to identify and rate the indices of professional ethics for faculty members using the fuzzy analytical hierarchy process (FAHP). Method: The statistical population of this descriptive-survey study included faculty mem...
متن کاملBounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary constant subblock-composition codes (CSCCs), where each codeword is partitioned into equal sized subblocks, and every subblock has the same fixed weight. The se...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001